75 research outputs found
Trivial Meet and Join within the Lattice of Monotone Triangles
The lattice of monotone triangles ordered by
entry-wise comparisons is studied. Let denote the unique minimal
element in this lattice, and the unique maximum. The number of
-tuples of monotone triangles with minimal infimum
(maximal supremum , resp.) is shown to
asymptotically approach as . Thus, with
high probability this event implies that one of the is
(, resp.). Higher-order error terms are also discussed.Comment: 15 page
On comparability of bigrassmannian permutations
Let Sn and Gn denote the respective sets of ordinary and bigrassmannian (BG) permutations of order n, and let (Gn,≤) denote the Bruhat ordering permutation poset. We study the restricted poset (Bn,≤), first providing a simple criterion for comparability. This criterion is used to show that that the poset is connected, to enumerate the saturated chains between elements, and to enumerate the number of maximal elements below r fixed elements. It also quickly produces formulas for β(ω) (α(ω), respectively), the number of BG permutations weakly below (weakly above, respectively) a fixed ω ∈ Bn, and is used to compute the Mo¨bius function on any interval in Bn.
We then turn to a probabilistic study of β = β(ω) (α = α(ω) respectively) for the uniformly random ω ∈ Bn. We show that α and β are equidistributed, and that β is of the same order as its expectation with high probability, but fails to concentrate about its mean. This latter fact derives from the limiting distribution of β/n3. We also compute the probability that randomly chosen BG permutations form a 2- or 3-element multichain
I\u27ve Got Your Number: A Multiple Choice Guessing Game
We consider the following guessing game: fix positive integers k, m, and n. Player A ( Ann ) chooses a (uniformly) random integer from the set {1,2,3,...,n}, but does not reveal it to Player B ( Gus ). Gus then presents Ann with a k-option multiple choice question about which number she chose, to which Ann responds truthfully. After m such questions have been asked, Gus must attempt to guess the number chosen by Ann. Gus wins if he guesses Ann\u27s number. The purpose of this note is to find all canonical m-question algorithms which maximize the probability of Gus winning the game. An analysis of a natural extension of this game is also presented
- …